Infinite Minkowski Sums of Lattice Polyhedra
نویسنده
چکیده
We show that certain two-dimensional, integrally closed monomial modules can be uniquely written as a countable product of isomorphic copies of simple integrally closed monomial ideals.
منابع مشابه
Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces
We present the first exact and robust implementation of the 3D Minkowski sum of two non-convex polyhedra. Our implementation decomposes the two polyhedra into convex pieces, performs pairwise Minkowski sums on the convex pieces, and constructs their union. We achieve exactness and the handling of all degeneracies by building upon 3D Nef polyhedra as provided by Cgal. The implementation also sup...
متن کاملMinkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in R. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R in terms of the number of facets of the summand polytopes. The complex...
متن کاملExact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D Using Collision Detection
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کاملA Simple Method for Computing Minkowski Sum Boundary in 3D
Computing the Minkowski sum of two polyhedra exactly has been shown difficult. Despite its fundamental role in many geometric problems in robotics, to the best of our knowledge, no 3-d Minkowski sum software for general polyhedra is available to the public. One of the main reasons is the difficulty of implementing the existing methods. There are two main approaches for computing Minkowski sums:...
متن کامل